منابع مشابه
Limited Packings in Graphs
A set of sensors is to be deployed to covertly monitor a facility. If too many sensors are placed close to any given location in the facility, then it is likely the presence of the sensors will be detected. Where then should the sensors be placed so that the total number we deploy is maximized while at the same time we avoid placing some threshold number close to any given location? There are m...
متن کاملBounds and algorithms for limited packings in graphs
We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graphG is a k-limited packing if for any vertex v ∈ V (G), |N [v] ∩X | ≤ k, where N [v] is the closed neighbourhood of v. The k-limited packing number Lk(G) is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility locat...
متن کاملThe probabilistic approach to limited packings in graphs
We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex v ∈ V (G), |N [v] ∩X| ≤ k, where N [v] is the closed neighbourhood of v. The k-limited packing number Lk(G) of a graph G is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility location problem...
متن کاملPackings in Complete Graphs
We deal with the concept of packings in graphs, which may be regarded as a generalization of the theory of graph design. In particular we construct a vertexand edge-disjoint packing of Kn (where n 2 mod 4 equals 0 or 1) with edges of different cyclic length. Moreover we consider edge-disjoint packings in complete graphs with uniform linear forests (and the resulting packings have special additi...
متن کاملNear Packings of Graphs
A packing of a graph G is a set {G1, G2} such that G1 ∼= G, G2 ∼= G, and G1 and G2 are edge disjoint subgraphs of Kn. Let F be a family of graphs. A near packing admitting F of a graph G is a generalization of a packing. In a near packing admitting F , the two copies of G may overlap so the subgraph defined by the edges common to both copies is a member of F . In the paper we study three famili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2010
ISSN: 0166-218X
DOI: 10.1016/j.dam.2009.04.014